Cohort query processing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cohort Query Processing

Modern Internet applications often produce a large volume of user activity records. Data analysts are interested in cohort analysis, or finding unusual user behavioral trends, in these large tables of activity records. In a traditional database system, cohort analysis queries are both painful to specify and expensive to evaluate. We propose to extend database systems to support cohort analysis....

متن کامل

Query Processing in Spatial-Query-by-Sketch

Spatial-Query-by-Sketch is the design of a query language for geographic information systems. It allows a user to formulate a spatial query by drawing the desired configuration with a pen on a touch-sensitive computer screen and translates this sketch into a symbolic representation that can the processed against a geographic database. Since the configurations queried usually do not match exactl...

متن کامل

Query Mesh: Multi-Route Query Processing Technology

We propose to demonstrate a practical alternative approach to the current state-of-the-art query processing techniques, called the “Query Mesh” (or QM, for short). The main idea of QM is to compute multiple routes (i.e., query plans), each designed for a particular subset of data with distinct statistical properties. Based on the execution routes and the data characteristics, a classifier model...

متن کامل

Multi Reachability Query Processing

There is a need to efficiently navigate on a large graph to find a certain piece of information by some structure constraints. Reachability query could be the main means for such a purpose and existing approaches studied an efficient primitive called reachability join. In this paper, we focus on processing the query containing multi reachability joins (R-joins). We studied the processing abilit...

متن کامل

Cache-Oblivious Query Processing

We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this automaticity and stableness of performance is at times more desirable than some peak performance achieved through careful tuning, especially because both database systems and hardware platforms are becoming increasingly co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the VLDB Endowment

سال: 2016

ISSN: 2150-8097

DOI: 10.14778/3015270.3015271